Non-malleable encryption of quantum information
نویسنده
چکیده
Andris Ambainis,1, 2 Jan Bouda,3 and Andreas Winter4, 5 Department of Computer Science, University of Latvia, Raina bulv. 19, Riga, LV-1586, Latvia Department of Combinatorics and Optimization & Institute for Quantum Computing, University of Waterloo Faculty of Informatics, Masaryk University, Botanická 68a, 602 00 Brno, Czech Republic Department of Mathematics, University of Bristol, Bristol BS8 1TW, U.K. Centre for Quantum Technologies, National University of Singapore, 3 Science Drive 2, Singapore 117543 (Dated: 3 February 2009)
منابع مشابه
A new security proof for FMNV continuous non-malleable encoding scheme
A non-malleable code is a variant of an encoding scheme which is resilient to tampering attacks. The main idea behind non-malleable coding is that the adversary should not be able to obtain any valuable information about the message. Non-malleable codes are used in tamper-resilient cryptography and protecting memories against tampering attacks. Many different types of non-malleability have alre...
متن کاملCompletely Non-malleable Encryption Revisited
Several security notions for public-key encryption schemes have been proposed so far, in particular considering the powerful adversary that can play a so called “man-in-the-middle” attack. In this paper we extend the notion of completely non-malleable encryption introduced in [Fischlin, ICALP 05]. This notion immunizes a scheme from adversaries that can generate related ciphertexts under new pu...
متن کاملLecture 16 : Non - Malleability and Public Key Encryption
Until this point we have discussed encryptions that prevent a passive attacker from discovering any information about messages that are sent. In some situations, however, we may want to prevent an attacker from creating a new message from a given encryption. Consider an auction for example. Suppose the Bidder Bob is trying to send a message containing his bid to the Auctioneer Alice. Private ke...
متن کاملNon-malleable Encryption: Equivalence between Two Notions, and an Indistinguishability-Based Characterization
We prove the equivalence of two de nitions of non-malleable encryption appearing in the literature| the original one of Dolev, Dwork and Naor and the later one of Bellare, Desai, Pointcheval and Rogaway. The equivalence relies on a new characterization of non-malleable encryption in terms of the standard notion of indistinguishability of Goldwasser and Micali. We show that non-malleability is e...
متن کاملNon-Malleable Codes from Average-Case Hardness: AC0, Decision Trees, and Streaming Space-Bounded Tampering
We show a general framework for constructing non-malleable codes against tampering families with average-case hardness bounds. Our framework adapts ideas from the Naor-Yung double encryption paradigm such that to protect against tampering in a class F , it suffices to have average-case hard distributions for the class, and underlying primitives (encryption and non-interactive, simulatable proof...
متن کامل